package com.vint.leetcode;


import java.util.LinkedList;
import java.util.Map;
import java.util.Queue;

/*
 * 寻找最大岛屿
 */
public class Leetcode695 {
    public int maxAreaOfIsland(int[][] grid) {
        if(grid==null) {
            return 0;
        }
        int length = grid.length;
        int width = grid[0].length;

        //init
        int[][] tags = new int[length][width];
        for(int i=0; i< length; i++) {
            for (int j = 0; j < width; j++) {
                tags[i][j] = 0;
            }
        }

        int max = 0;
        //visit
        for(int i=0; i< length; i++) {
            for (int j = 0; j < width; j++) {
                if(tags[i][j]==1){
                    continue;
                }
                //if(t)
            }
        }
        return max;
    }
    public int sizeIsland(int[][]grid, int w, int h, int w1, int h1){
        int max = 0;
        if(grid[w1][h1]==0){
            return max;
        }
        int[][] tags = new int[w][h];
        for(int i=0; i< w; i++) {
            for (int j = 0; j < h; j++) {
                tags[i][j] = 0;
            }
        }
        max++;
        Queue<Node> queue = new LinkedList<Node>();
        return 0;
    }

    class Node{
        int value;
        int w;
        int h;
        Node(int v, int w1, int h1){
           value = v;
           w = w1;
           h = h1;
        }
    }
    public static void main(String[] args) {
    }
  }
